Floorplanning with Datapath Optimization - Circuits and Systems, 1995. ISCAS '95., 1995 IEEE International Symposium on
نویسندگان
چکیده
This paper presents a jfloorplanner for datapath with the capability of re-allocating data storage for minimizing the interconnect area and critical path delay without altering the number of Functional units and the schedule. The tool has combined two novel approaches: 1 A placement & Routing model to handle different architectural topologies (mux. and/ or bus based) suitable for FPGA's. 2 An efJicient formulation for the biruling of register/lnterconnect & combined Floorplanning. The complexity of the architectural and jloorplanning model, and of the cost finction, have led us to the use of a stochastic optimization process. The running time of the whole process indicates the viability of the method. We show through various examples how the jloorplmner improves the area and critical path delay of the datapath compared to a plainjloorplannel: The improvement is about 20% for the critical path delay when this objective is a stringent constraint.
منابع مشابه
Retiming of Circuits Containing Multiplexers - Circuits and Systems, 1995. ISCAS '95., 1995 IEEE International Symposium on
Classical retiming optimization algorithnis do not consider circuits containing multiplexers or demultiplexers driven by a clock signal l , because the associated retiming equations differ from the special classical form, which make applicable conibinatorialalgorithnisofpolynomial order. In order to provide an algorithm for multiplexer circuits it is shown here that retiming, being an integer l...
متن کاملExploration of Area and Performance Optimized Datapath Design Using Realistic Cost Metrics
We present a novel technique for datapath allocation, which incorporates interconnection area and delay estimates based on dynamic oorplanning. In this approach, datapath area is minimized by minimizing the number of wires, routing tracks, and multiplexers, while performance is optimized by minimizing wire length. The simultaneous optimization of these physical cost metrics allows the system to...
متن کاملTime and Frequency Split Zak Transform for Finite Gabor Expansion - Circuits and Systems, 1995. ISCAS '95., 1995 IEEE International Symposium on
The relationship between finite discrete Zak transform and finite Gabor expansion are well discussed in this paper. In this paper, we present two DFT-based algorithms for computing Gabor coefficients. One is based upon the time-split Zak transform, the other is frequencysplit Zak transform. These two methods are time and frequency dual pairs. Furthermore, we extend the relationship between fini...
متن کاملOptimizing power using transformations
The increasing demand for portable computing has elevated power consumption to be one of the most critical design parameters. A high-level synthesis system, HYPER-LP, is presented for minimizing power consumption in application specific datapath intensive CMOS circuits using a variety of architectural and computational transformations. The synthesis environment consists of high-level estimation...
متن کامل